Math 209: Important Formulas

نویسنده

  • STEVEN MILLER
چکیده

These notes give a brief summary of the major techniques of the class, and an example for each. The descriptions are kept short so that this can be a useful, quick reference. 1. Executive Summary We record below the types of equations we can solve. In the next sections we give more details, including conditions on the functions and, if possible, explicit solutions. This section is meant to be a quick list. • Linear, constant coefficient difference equations: an+1 = c1an+c2an−1+c3an−2+ · · ·+ ckan−k+1; for example, an+1 = 3an + 4an−1 − 2an−2. See §2. • Integrating factors: dy/dt+ p(t)y(t) = g(t). See §3.1. • Separable equations: M(x) +N(y)dy/dx = 0. See §3.2. • Exact equations: M(x, y) +N(x, y)dy/dx = 0 with ∂M/∂y = ∂N/∂x. See §3.3. • Second order linear constant coefficient homogenous equations: dy/dt + ady/dt+ by = 0. See §4.1. • Method of Undermined Coefficients: ay′′ + by′ + cy = g(t) with g(t) = ePn(t) (with Pn(t) a polynomial of degree n in t) or g(t) = e αt cos(βt) or g(t) = e sin(βt). See §4.2. • Variation of Parameters: Let p, q, g continuous functions and consider y′′(t) + p(t)y′(t) + q(t)y = g(t) with known solutions to the homogenous equation. See §4.3. • Series expansions: p(x)y′′(x)+q(x)y′(x)+r(x)y(x) = 0 with p(x0) 6= 0 and guessing y(x) = ∑∞ n=0 an(X − x0). See §5. • Linear systems: − →x ′(t) = A− →x (t) +− →g (t) with − →x (0) = − →x 0. See §6. Date: April 28, 2009. 1 2 INSTRUCTOR: STEVEN MILLER 2. Difference Equations 2.1. Linear, constant coefficient difference equations. Statement: Let k be a fixed integer and c1, . . . , ck given real numbers. Then the general solution of the difference equation an+1 = c1an + c2an−1 + c3an−2 + · · ·+ ckan−k+1 is an = γ1r n 1 + · · ·+ γkr k if the characteristic polynomial r − c1r − c2r − · · · − ck = 0 has k distinct roots. Here the γ1, . . . , γk are any k real numbers; if initial conditions are given, these conditions determine these γi’s. Example: Consider the equation an+1 = 5an − 6an−1. In this case k = 2 and we find the characteristic polynomial is r − 5r + 6 = (r − 2)(r − 3), which clearly has roots r1 = 2 and r2 = 3. Thus the general solution is an = γ12 n + γ23 . If we are given a0 = 1 and a1 = 2, this leads to the system of equations 1 = γ1 + γ2 and 2 = γ1 · 2 + γ2 · 3, which has the solution γ1 = 1 and γ2 = 0. Applications: Population growth (such as the Fibonacci equation), why double-plus-one is a bad strategy in roulette. 3. First Order Differential Equations 3.1. Integrating factors. Statement: For a differential equation of the form y′(t) + p(t)y(t) = g(t), the general solution is y(t) = 1 μ(t) [∫ μ(t)g(t)dt+ C ] , where μ(t) = exp (∫ p(t)dt ) and C is a free constant (if an initial condition is given, then C can be determined uniquely). Example: Consider the equation y′(t)− 2ty(t) = exp (t + t). Then μ(t) = exp (∫ −2tdt ) = exp(−t), MATH 209: IMPORTANT FORMULAS 3

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two chain rules for divided differences and Faà di Bruno's formula

In this paper we derive two formulas for divided differences of a function of a function. Both formulas lead to other divided difference formulas, such as reciprocal and quotient rules. The two formulas can also be used to derive Faà di Bruno’s formula and other formulas for higher derivatives of composite functions. We also derive a divided difference version of Faà di Bruno’s determinant form...

متن کامل

Determinant formulas for class numbers in function fields

In this paper, by extending Kucera’s idea to the function field case, we obtain several determinant formulas involving the real class number and the relative class number of any subfield of cyclotomic function fields. We also provide several examples using these determinant formulas.

متن کامل

Evaluation formulas for Tornheim's type of alternating double series

In this paper, we give some evaluation formulas for Tornheim’s type of alternating series by an elementary and combinatorial calculation of the uniformly convergent series. Indeed, we list several formulas for them by means of Riemann’s zeta values at positive integers.

متن کامل

Explicit formulas for monomial involutions over finite fields

Francis Castro, Carlos Corrada, Natalia Pacheco∗, Ivelisse Rubio, University of Puerto Rico, Ŕıo Piedras Permutations of finite fields have important applications in cryptography and coding theory. Involutions are permutations that are its own inverse and are of particular interest because the implementation used for coding can also be used for decoding. We present explicit formulas for all the...

متن کامل

Error bounds for Gauss-Tur'an quadrature formulae of analytic functions

We study the kernels of the remainder term Rn,s(f) of GaussTurán quadrature formulas ∫ 1 −1 f(t)w(t) dt = n ∑

متن کامل

Kronrod extensions with multiple nodes of quadrature formulas for Fourier coefficients

We continue with analyzing quadrature formulas of high degree of precision for computing the Fourier coefficients in expansions of functions with respect to a system of orthogonal polynomials, started recently by Bojanov and Petrova [Quadrature formulae for Fourier coefficients, J. Comput. Appl. Math. 231 (2009), 378–391] and we extend their results. Construction of new Gaussian quadrature form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009